Quasi - Monte Carlo Methods in Computer Graphics
نویسنده
چکیده
The problem of global illumination in computer graphics is described by a Fredholm integral equation of the second kind. Due to the complexity of this equation, Monte Carlo methods provide an efficient tool for the estimation of the solution. A new approach, using quasi-Monte Carlo integration, is introduced and compared to Monte Carlo integration. We discuss some theoretical aspects and give numerical evidence for the faster convergence of the quasi-Monte Carlo methods.
منابع مشابه
Quasi-Monte Carlo Methods in Computer Graphics, Part II: The Radiance Equation
The radiance equation, which describes the global illumination problem in computer graphics, is a high dimensional integral equation. Estimates of the solution are usually computed on the basis of Monte Carlo methods. In this paper we propose and investigate quasi-Monte Carlo methods, which means that we replace (pseudo-) random samples by low discrepancy sequences, yielding deterministic algor...
متن کاملQuasi-Monte Carlo Methods in Computer Graphics: The Global Illumination Problem
The main part of the global illumination problem of computer graphics is given by a Fredholm integral equation of the second kind, describing the light distribution in a closed environment. Calculating photorealistic images from that equation requires its kernel to be very complex and discontinuous. Due to this complexity Monte Carlo methods are an interesting tool for estimating a solution. In...
متن کاملQuasi-monte Carlo Methods in Computer Graphics, Part I: the Qmc-buuer
Monte Carlo integration is often used for antialiasing in rendering processes. Due to low sampling rates only expected error estimates can be stated, and the variance can be high. In this article quasi-Monte Carlo methods are presented, achieving a guaranteed upper error bound and a convergence rate essentially as fast as usual Monte Carlo.
متن کاملA Quasi-Monte Carlo Algorithm for the Global Illumination Problem in the Radiosity Setting
One of the main problems in computer graphics is to solve the global illumination problem, which is given by a Fredholm integral equation of the second kind, called the radiance equation (REQ). In order to achieve realistic images, a very complex kernel of the integral equation, modelling all physical effects of light, must be considered. Due to this complexity Monte Carlo methods seem to be an...
متن کاملAnalysis of the Quasi-Monte Carlo Integration of the Rendering Equation
Quasi-Monte Carlo integration is said to be better than Monte-Carlo integration since its error bound can be in the order of O(N (1 )) instead of the O(N 0:5) probabilistic bound of classical Monte-Carlo integration if the integrand has finite variation. However, since in computer graphics the integrand of the rendering equation is usually discontinuous and thus has infinite variation, the supe...
متن کامل